The Ordering of Commutative Terms
نویسنده
چکیده
By a commutative term we mean an element of the free commutative groupoid F of infinite rank. For two commutative terms a, b write a ≤ b if b contains a subterm that is a substitution instance of a. With respect to this relation, F is a quasiordered set which becomes an ordered set after the appropriate factorization. We study definability in this ordered set. Among other thing, we prove that every commutative term (or its block in the factor) is a definable element. Consequently, the ordered set has no automorphisms except the identity.
منابع مشابه
Negations and aggregation operators based on a new hesitant fuzzy partial ordering
Based on a new hesitant fuzzy partial ordering proposed by Garmendia et al.~cite{GaCa:Pohfs}, in this paper a fuzzy disjunction ${D}$ on the set ${H}$ of finite and nonempty subsets of the unit interval and a t-conorm ${S}$ on the set $bar{{B}}$ of equivalence class on the set of finite bags of unit interval based on this partial ordering are introduced respectively. Then, hesitant fuzzy negati...
متن کاملA Total, Ground path Ordering for Proving Termination of AC-Rewrite Systems
A new path ordering for showing termination of associative-commutative (AC) rewrite systems is deened. If the precedence relation on function symbols is total, the ordering is total on ground terms, but unlike the ordering proposed by Rubio and Nieuwenhuis, this ordering can orient the distributivity property in the proper direction. The ordering is deened in a natural way using recursive path ...
متن کاملAssociative-Commutative Superposition
We present an associative-commutative paramodulation calculus that generalizes the associativecommutative completion procedure to first-order clauses. The calculus is parametrized by a selection function (on negative literals) and a well-founded ordering on terms. It is compatible with an abstract notion of redundancy that covers such simplification techniques as tautology deletion, subsumption...
متن کاملProving Associative-Communicative Termination Using RPO-Compatible Orderings
Developing path orderings for associative-commutative (AC) rewrite systems has been quite a challenge at least for a decade. Compatibility with the recursive path ordering (RPO) schemes is desirable, and this property helps in orienting the commonly encountered distributiv-ity axiom as desired. For applications in theorem proving and constraint solving, a total ordering on ground terms involvin...
متن کاملOn the Fully Commutative Elements of Coxeter Groups
Let W be a Coxeter group. We define an element w ~ W to be fully commutative if any reduced expression for w can be obtained from any other by means of braid relations that only involve commuting generators. We give several combinatorial characterizations of this property, classify the Coxeter groups with finitely many fully commutative elements, and classify the parabolic quotients whose membe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011